Shadows of blow-up algebras

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shadows of Blow-up Algebras

We study di erent notions of blow-up of a scheme X along a subscheme Y , depending on the datum of an embedding of X into an ambient scheme. The two extremes in this theory are the ordinary blow-up, corresponding to the identity, and the `quasi-symmetric blow-up', corresponding to the embedding of X into a nonsingular variety. We prove that this latter blow-up is intrinsic of Y and X , and is u...

متن کامل

Derivations of UP-algebras by means of UP-endomorphisms

The notion of $f$-derivations of UP-algebras is introduced, some useful examples are discussed, and related properties are investigated. Moreover, we show that the fixed set and the kernel of $f$-derivations are UP-subalgebras of UP-algebras,and also give examples to show that the two sets are not UP-ideals of UP-algebras in general.

متن کامل

Testing Graph Blow-Up

Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Sp...

متن کامل

Homogenization by blow-up

In this paper we highlight how the Fonseca and Müller blow-up technique is particularly well suited for homogenization problems. As examples we give a simple proof of the nonlinear homogenization theorem for integral functionals and we prove a homogenization theorem for sets of finite perimeter.

متن کامل

Blow-Up Lemma

The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tohoku Mathematical Journal

سال: 2004

ISSN: 0040-8735

DOI: 10.2748/tmj/1113246753